Latin Squares with No Small Odd Plexes

نویسندگان

  • Judith Egan
  • Ian M. Wanless
چکیده

A k-plex in a Latin square of order n is a selection of kn entries in which each row, column, and symbol is represented precisely k times.A transversal of aLatin square corresponds to the case k = 1. We show that for all even n > 2 there exists a Latin square of order n which has no k-plex for any odd k < n4 but does have a k-plex for every other k ≤ 1 2n. © 2008 Wiley Periodicals, Inc. J Combin Designs 16: 477–492, 2008

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Indivisible partitions of latin squares

In a latin square of order n, a k-plex is a selection of kn entries in which each row, column and symbol occurs k times. A 1-plex is also called a transversal. An indivisible k-plex is one that contains no c-plex for 0ocok. For orders n= 2f2,6g, existence of latin squares with a partition into 1-plexes was famously shown in 1960 by Bose, Shrikhande and Parker. A main result of this paper is tha...

متن کامل

A Generalisation of Transversals for Latin Squares

We define a k-plex to be a partial latin square of order n containing kn entries such that exactly k entries lie in each row and column and each of n symbols occurs exactly k times. A transversal of a latin square corresponds to the case k = 1. For k > n/4 we prove that not all k-plexes are completable to latin squares. Certain latin squares, including the Cayley tables of many groups, are show...

متن کامل

Indivisible plexes in latin squares

A k-plex is a selection of kn entries of a latin square of order n in which each row, column and symbol is represented precisely k times. A transversal of a latin square corresponds to the case k = 1. A k-plex is said to be indivisible if it contains no c-plex for any 0 < c < k. We prove that if n = 2km for integers k ≥ 2 and m ≥ 1 then there exists a latin square of order n composed of 2m disj...

متن کامل

A generalization of plexes of Latin squares

A k-plex of a latin square is a collection of cells representing each row, column, and symbol precisely k times. The classic case of k = 1 is more commonly known as a transversal. We introduce the concept of a k-weight, an integral weight function on the cells of a latin square whose row, column, and symbol sums are all k. We then show that several non-existence results about k-plexes can been ...

متن کامل

Subsquare-free Latin squares of odd order

For every odd positive integer m we prove the existence of a Latin square of order 3m having no proper Latin subsquares. Combining this with previously known results it follows that subsquare-free Latin squares exist for all odd orders. © 2005 Elsevier Ltd. All rights reserved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008